On the modified AIMD algorithm for distributed resource management with saturation of each user's share

Title: On the modified AIMD algorithm for distributed resource management with saturation of each user's share
Creator: Stüdli, S.; Corless, M.; Middleton, R. H.; Shorten, R.
Relation: 2015 IEEE 54th Annual Conference on Decision and Control (CDC). Proceedings of the 2015 IEEE 54th Annual Conference on Decision and Control (Osaka, Japan 15-18 December, 2015) p. 1631-1636
Publisher Link: http://dx.doi.org/10.1109/CDC.2015.7402444
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Resource Type: conference paper
Date: 2016
Description: Recently the additive increase multiplicative decrease (AIMD) algorithm has been applied in fields other than congestion control in communications networks. A major attribute of these new applications is that the share of each user is bounded. Simulations suggest that AIMD performs well, even in the case of individual constraints on each user. In this paper, we provide a formal proof of exponential convergence to a unique fixed-point for the AIMD algorithm under individual user constraints.
Subject: context; additives; smart grids; upper bound; convergence; optimization; artificial intelligence
Identifier: http://hdl.handle.net/1959.13/1323434
Identifier: uon:24809
Identifier: ISBN:9781479978861
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format